Integer Based Fully Homomorphic DSP Accelerator using Weighted-Number Theoretic Transform
نویسندگان
چکیده
Fully Homomorphic Encryption (FHE) has gained wide attention in cloud security as it allows computation on encrypted data. However, requires a huge key size, resulting impractical execution time. In this paper, we proposed an FHE hardware accelerator employing Weighted-Number Theoretic Transform (NTT) multiplier. NTT parameters are selected, way that the design is executable Digital Signal Processing (DSP) multiplier, to exploit its high clock rate. As kernel, general form, can be pre-computed and stored Look-up Tables (LUTs). The same LUTs also usable for weight-factor they both have symmetric periodicity properties. This optimization saved 70% of utilization. Next reduction within NTT. special prime moduli exploited accomplish simple operation, where inverse Montgomery multiplication replaced with shift subtraction. optimizations implemented encryption realized Kintex 7 platform. A magnitude 93.2% speedup improvement achieved Toy, compared benchmark software implementation. targeted full DSP implementation, higher frequency (249.19 MHz), while consuming lower resources.
منابع مشابه
Secure Fast Fourier Transform using Fully Homomorphic Encryption
Secure signal processing is becoming a de facto model for preserving privacy. We propose a model based on the Fully Homomorphic Encryption (FHE) technique to mitigate security breaches. Our framework provides a method to perform a Fast Fourier Transform (FFT) on a user-specified signal. Using encryption of individual binary values and FHE operations over addition and multiplication, we enable a...
متن کاملNumber Theoretic Transform -based Block Motion Estimation
A new fast full search algorithm for block motion estimation is presented, which is based on convolution theorem and number theoretic transforms. The algorithm applies the sum of squared differences (SSD) criterion, and the encoded video quality is equivalent or even better than what is achieved with conventional methods, but the algorithm has low theoretical complexity. The algorithm is implem...
متن کاملVery fast discrete Fourier transform, using number theoretic transform
It is shown that number theoretic transforms (NTT) can be used to compute discrete Fourier transform (DFT) very efficiently. By noting some simple properties of number theory and the DFT, the total number of real multiplications for a length-P DFT is reduced to (P — 1). This requires less than one real multiplication per point. For a proper choice of transform length and NTT, the number of shif...
متن کاملFully Homomorphic Encryption with Composite Number Modulus
Gentry’s bootstrapping technique is the most famous method of obtaining fully homomorphic encryption. In previous work I proposed a fully homomorphic encryption without bootstrapping which has the weak point in the plaintext [1][18]. In this paper I propose the improved fully homomorphic encryption scheme on non-associative octonion ring over finite ring with composite number modulus where the ...
متن کاملThe Number Theoretic Hilbert Transform
Abstract This paper presents a general expression for a number-theoretic Hilbert transform (NHT). The transformations preserve the circulant nature of the discrete Hilbert transform (DHT) matrix together with alternating values in each row being zero and non-zero. Specific examples for 4point, 6-point, and 8-point NHT are provided. The NHT transformation can be used as a primitive to create cry...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Research in Applied Sciences and Engineering Technology
سال: 2023
ISSN: ['2462-1943']
DOI: https://doi.org/10.37934/araset.30.3.362371